Pancyclicity of 4-Connected, Claw-Free, P10-Free Graphs

نویسندگان

  • Michael Ferrara
  • Timothy Morris
  • Paul S. Wenger
چکیده

A graph G is said to be pancyclic if G contains cycles of all lengths from 3 to |V (G)|. We show that if G is 4-connected, claw-free, and P10-free, then G is either pancyclic or it is the line graph of the Petersen graph. This implies that every 4-connected, claw-free, P9-free graph is pancyclic, which is best possible and extends a result of Gould et al. Pancyclicity in 3-connected graphs: Pairs of forbidden subgraphs, [J Graph Theory 47 (2004), 183–202]. C © 2012 Wiley Periodicals, Inc. J. Graph Theory 00: 1–13, 2012

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs

We characterize all pairs of connected graphs {X,Y } such that each 3-connected {X,Y }-free graph is pancyclic. In particular, we show that if each of the graphs in such a pair {X,Y } has at least four vertices, then one of them is the claw K1,3, while the other is a subgraph of one of six specified graphs.

متن کامل

Hamiltonicity in 3-connected claw-free graphs

Kuipers and Veldman conjectured that any 3-connected claw-free graph with order ν and minimum degree δ ≥ ν+6 10 is Hamiltonian for ν sufficiently large. In this paper, we prove that if H is a 3-connected claw-free graph with sufficiently large order ν, and if δ(H) ≥ ν+5 10 , then either H is hamiltonian, or δ(H) = ν+5 10 and the Ryjác̆ek’s closure cl(H) of H is the line graph of a graph obtained...

متن کامل

Pancyclicity of 4-connected {claw, generalized bull}-free graphs

A graph G is pancyclic if it contains cycles of each length `, 3 ≤ ` ≤ |V (G)|. The generalized bull B(i, j) is obtained by associating one endpoint of each of the paths Pi+1 and Pj+1 with distinct vertices of a triangle. Gould, Luczak and Pfender [4] showed that if G is a 3-connected {K1,3, B(i, j)}-free graph with i + j = 4 then G is pancyclic. In this paper, we prove that every 4-connected, ...

متن کامل

Closure and stable Hamiltonian properties in claw-free graphs

In the class of k-connected claw-free graphs, we study the stability of some hamilto-nian properties under a closure operation introduced by the third author. We prove that (i) the properties of pancyclicity, vertex pancyclicity and cycle extendability are not stable for any k (i.e., for any of these properties there is an innnite family of graphs G k of arbitrarily high connectivity k such tha...

متن کامل

Pancyclicity mod k of claw-free graphs and K1, 4-free graphs

For any natural number k, a graph G is said to be pancyclic mod k if it contains a cycle of every length modulo k. In this paper, we show that every K1,4-free graph G with minimum degree δ(G) ≥ k+ 3 is pancyclic mod k and every claw-free graph G with δ(G) ≥ k+ 1 is pancyclic mod k, which confirms Thomassen’s conjecture [8] for claw-free graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 71  شماره 

صفحات  -

تاریخ انتشار 2012